Regeneration and general Markov chains
نویسندگان
چکیده
منابع مشابه
Chapter 2 General Markov Chains
The setting of this Chapter is a nite-state irreducible Markov chain (X t), either in discrete time (t = 0; 1; 2; : : :) or in continuous time (0 t < 1). Highlights of the elementary theory of general (i.e. not-necessarily-reversible) Markov chains are readily available in several dedicated textbooks and in chapters of numerous texts on introductory probability or stochastic processes (see the ...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملRegeneration-based statistics for Harris recurrent Markov chains
Harris Markov chains make their appearance in many areas of statistical modeling, in particular in time series analysis. Recent years have seen a rapid growth of statistical techniques adapted to data exhibiting this particular pattern of dependence. In this paper an attempt is made to present how renewal properties of Harris recurrent Markov chains or of specific extensions of the latter may b...
متن کامل4 General State Space Markov Chains and Mcmc Algorithms
Abstract. This paper surveys various results about Markov chains on general (noncountable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivation and context for the theory which follows. Then, sufficient conditions for geometric and uniform ergodicity, along with quantitative bounds on the rate of convergence to stationarity in ...
متن کاملGeneral state space Markov chains and MCMC algorithms
This paper surveys various results about Markov chains on general (non-countable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivation and context for the theory which follows. Then, sufficient conditions for geometric and uniform ergodicity are presented, along with quantitative bounds on the rate of convergence to stationarit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Stochastic Analysis
سال: 1994
ISSN: 1048-9533,1687-2177
DOI: 10.1155/s1048953394000304